Decompositional Modeling through Caricatural Reasoning
نویسندگان
چکیده
Many physical phenomena are suuciently complex that the corresponding equations aaord little insight, or no analytical method provides an exact solution. Decompositional modeling (DM) captures a modeler's tacit skill at solving non-linear algebraic systems. DM divides statespace into a patchwork of simpler subregimes, called caricatures, each of which preserves only the dominant characteristics of that regime. It then solves the simpler nonlinear system and identiies its domain of validity. The varying patchwork reeects how variations in the parameters change the dominant characteristics. The patchwork is built by extracting equational features consisting of the relative strength of terms, and then ex-agerating and merging these features in diierent combinations, resulting in the diierent caricatu-ral regimes. DM operates by providing strategic guidance to a pair of symbolic manipulation systems for qualitative sign and order of magnitude algebra. The approach is suucient to replicate a broad set of examples from acid-base chemistry.
منابع مشابه
ecompositional Modeling through Caricatural easoning
Many physical phenomena are sufficiently complex that the corresponding equations afford little insight, or no analytical method provides an exact solution. Decompositional modeling (DM) captures a modeler’s tacit skill at solving nonlinear algebraic systems. DM divides statespace into a patchwork of simpler subregimes, called caricatures, each of which preserves only the dominant characteristi...
متن کاملToward Combining Domain Theory and Recipes in Plan Recognition
We present a technique to further narrow the gap between recipe-based and domain theory-based plan recognition through decompositional planning, a planning model that combines hierarchical reasoning as used in hierarchical task networks, and least-commitment refinement reasoning as used in partial-order causal link planning. We represent recipes through decompositional planning operators and us...
متن کاملDecompositional Reasoning about the History of Parallel Processes
This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning tech...
متن کاملDecompositional, Model-based Learning and its Analogy to Diagnosis
A new generation of sensor rich, massively distributed autonomous system is being developed, such as smart buildings and reconfigurable factories. To achieve high performance these systems will need to accurately model themselves and their environment from sensor information. Accomplishing this on a grand scale requires automating the art of large-scale modeling. To this end we have developed d...
متن کاملCaricatures: Generating Models of Dominant Behavior
When analyzing most physical phenomena the complexity of the corresponding equations rapidly becomes such that there are no general methods to derive exact solutions. A solution prevalent in acid-base chemistry is to construct a simplified solution that preserves only the dominant behaviors. Since what dominates varies, for example, depending on the strength of the acid or its initial concentra...
متن کامل